package easy;

public class offer11_旋转数组的最小数字 {
    public int minArray(int[] numbers) {
        for(int i=0;i<numbers.length-1;i++){
            if (numbers[i]>numbers[i+1]){
                return numbers[i+1];
            }
        }
        return numbers[0];
    }
}
